The Representational Inadequacy of Ramsey Sentences
نویسنده
چکیده
we canvas a number of past uses of Ramsey sentences which have yielded disappointing results, and then consider three very interesting recent attempts to deploy them for a Ramseyan dialetheist theory of truth, a modal account of laws and theories, and a criterion for the existence of factual properties. we think that once attention is given to the specific kinds of theories that Ramsey had in mind, it becomes evident that their Ramsey sentences are not the best ways of presenting those theories.
منابع مشابه
The Ramsey Test and the Indexicality of Conditionals: A Proposed Resolution of Gärdenfors' Paradox
Working within the AGM approach, Peter Gärdenfors has proved that — given certain auxiliary assumptions — there are no non-trivial belief revision systems that satisfy both the Ramsey test and the Preservation condition. There are various ways of reacting to Gärdenfors' paradoxical result. Gärdenfors himself has described his result as a dilemma: we must give up either the Ramsey test or the Pr...
متن کاملZarankiewicz Numbers and Bipartite Ramsey Numbers
The Zarankiewicz number z(b; s) is the maximum size of a subgraph of Kb,b which does not contain Ks,s as a subgraph. The two-color bipartite Ramsey number b(s, t) is the smallest integer b such that any coloring of the edges of Kb,b with two colors contains a Ks,s in the rst color or a Kt,t in the second color.In this work, we design and exploit a computational method for bounding and computing...
متن کاملCarnap and the Rational Reconstruction of the Language of Physics
0 Introduction 1 Logicism, Hilbert and the problem of a priori knowledge 2 Special relativity and the fact/convention dichotomy 3 Theoretical and observational sentences 4 Correspondence rules 5 Ramsey and Carnap sentences and the distinction between the factual and the conventional 6 A Quinean problem and its solution 7 Considerations in favor of Carnap’s reconstruction 8 Is a theory its Ramse...
متن کاملAll Ramsey (2K2,C4)−Minimal Graphs
Let F, G and H be non-empty graphs. The notation F → (G,H) means that if any edge of F is colored by red or blue, then either the red subgraph of F con- tains a graph G or the blue subgraph of F contains a graph H. A graph F (without isolated vertices) is called a Ramsey (G,H)−minimal if F → (G,H) and for every e ∈ E(F), (F − e) 9 (G,H). The set of all Ramsey (G,H)−minimal graphs is denoted by ...
متن کامل‘Representational Repertoires’ of Neoliberal Ideologies in Interchange (Third Edition) Series
Considering the fact that engagement with political economy is central to any fully rounded analysis of language and language-related issues in the neoliberal-stricken world today, and that applied linguistics has ignored the role of political economy (Block, Gray, & Holborow, 2012), for the first time, this study investigated the representations of neoliberal ideologies in the Interchange Thi...
متن کامل